Improving Gnutella Query Search Algorithm with Jumps
نویسندگان
چکیده
The measurement of a search algorithm for unstructured P2P network centres on the number of nodes not receiving their requested files (number of failures) and the number of hops per query. Most current search algorithms are unable to guarantee the success of the query. This study involves a comparison of the strengths and weaknesses of three algorithms of Gnutella P2P protocol, namely Flood, Random Walk, and Random Walk with Neighbours Table. Based on this comparison, a new query search method—referred to as Random Walk with Jumps—is proposed. The experiment proves that the proposed algorithm can obtain a better result with a small number of failures and a minimum number of hops.
منابع مشابه
Search Performance Analysis in Peer-to-Peer Networks
Recently Peer-to-Peer networks (P2P) have gained great attention and popularity. One key challenging aspect in P2P resource sharing environments is efficient searching algorithm. This is especially important for Gnutella-like decentralized and unstructured networks since they have power-law degree distributions. A robust search algorithm should respond to the query message promptly without gene...
متن کاملEfficient Search in Gnutella-Like "Small-World" Peer-to-Peer Systems
Gnutella-like peer-to-peer file -sharing systems have been widely deployed on the Internet. However, current search techniques used in existing Gnutella -like peer-to-peer systems are often inefficient. We demonstrated the strong “small-world” property of Gnutella systems and proposed an efficient search approach CSTM to utilize the property. In CSTM, each peer maintains a local state table, wh...
متن کاملImproving Resilience against DDoS Attack in Unstructured P2P Networks
In unstructured peer-to-peer (P2P) systems such as Gnutella, a general routing search algorithm is used to blindly flood a query through network among peers. But unfortunately, malicious nodes could easily make use of the search approach launching distributed denial of service (DDoS) attack which aims at the whole network. In order to alleviate or minimize the bad effect due to behavior of mali...
متن کاملEnhancing P2P File-Sharing with an Internet-Scale Query Processor
In this paper, we address the problem of designing a scalable, accurate query processor for peerto-peer filesharing and similar distributed keyword search systems. Using a globally-distributed monitoring infrastructure, we perform an extensive study of the Gnutella filesharing network, characterizing its topology, data and query workloads. We observe that Gnutella’s query processing approach pe...
متن کاملEPITELLA: Improving the Gnutella Search Algorithm through Epidemic Spreading Models for Complex Networks
Search algorithms in unstructured P2P networks such as Gnutella use flooding-based techniques for communication and, as a consequence, they produce high message overhead. More dynamic algorithms such as Gnutella’s Dynamic Query Protocol take into account the user’s desired number of results and network topology properties to increase scalability. However, these algorithms only work well for pop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016